Lipschitz

نویسندگان

چکیده

We give conditions that ensure an operator satisfying a Piestch domination in given setting also satisfies different setting. From this we derive bounded multilinear T T is Lipschitz alttext="p"> p encoding="application/x-tex">p -summing if and only the mapping alttext="f Subscript upper T Baseline left-parenthesis x 1 circled-times midline-horizontal-ellipsis n right-parenthesis colon-equal comma ellipsis right-parenthesis"> f ( x 1 ⊗ ⋯<!-- ⋯ <mml:mi>n stretchy="false">) ≔ , …<!-- … </mml:mrow> encoding="application/x-tex">f_T(x_1\otimes \cdots \otimes x_n)≔T(x_1,\ldots , x_n) -summing. The results are based on projective tensor norm. An example with Hilbert norm provided to show statement may not hold when reasonable cross-norm other than considered.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lipschitz Bandits without the Lipschitz Constant

We consider the setting of stochastic bandit problems with a continuum of arms indexed by [0, 1]. We first point out that the strategies considered so far in the literature only provided theoretical guarantees of the form: given some tuning parameters, the regret is small with respect to a class of environments that depends on these parameters. This is however not the right perspective, as it i...

متن کامل

Simplicial Lipschitz optimization without the Lipschitz constant

In this paper we propose a new simplicial partition-based deterministic algorithm for global optimization of Lipschitz-continuous functions without requiring any knowledge of the Lipschitz constant. Our algorithm is motivated by the well-known Direct algorithm which evaluates the objective function on a set of points that tries to cover the most promising subregions of the feasible region. Almo...

متن کامل

Lipschitz Games

The Lipschitz constant of a finite normal–form game is the maximal change in some player's payoff when a single opponent changes his strategy. We prove that games with small Lipschitz constant admit pure ǫ-equilibria, and pinpoint the maximal Lipschitz constant that is sufficient to imply existence of pure ǫ-equilibrium as a function of the number of players in the game and the number of strate...

متن کامل

Lipschitz Percolation

We prove the existence of a (random) Lipschitz function F : Z → Z such that, for every x ∈ Z, the site (x, F (x)) is open in a site percolation process on Z. The Lipschitz constant may be taken to be 1 when the parameter p of the percolation model is sufficiently close to 1.

متن کامل

lipschitz groups and lipschitz maps

‎this contribution mainly focuses on some aspects of lipschitz groups‎, ‎i.e.‎, ‎metrizable groups with lipschitz multiplication and inversion map‎. ‎in the main result it is proved that metric groups‎, ‎with a translation-invariant metric‎, ‎may be characterized as particular group objects in the category of metric spaces and lipschitz maps‎. ‎moreover‎, ‎up to an adjustment of the metric‎, ‎a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2022

ISSN: ['2330-1511']

DOI: https://doi.org/10.1090/proc/16115